On the Zero-Rate Error Exponent of the Exponential-Server Timing Channel
نویسندگان
چکیده
We prove that the zero-rate error exponent of the exponential-server timing channel is at least μ/2, where 1/μ is the mean service time. This proves that at low data rates, the timing channel is strictly more reliable than the related Poisson channel with peak intensity μ and zero dark current. This answers a question recently posed by Arikan, who proved that the timing channel’s reliability function is at least as large as the Poisson channel’s at all rates, and that the two reliability functions coincide at high rates. Our proofs provide insight into the construction of good codes for the timing channel by revealing a useful distance metric between codewords.
منابع مشابه
Venkat Anantharam The Reliability of Communicating Information Through Timing via an Exponential Server
A single server queue can be viewed as a communication channel where information is encoded into the times of arrivals of packets into the queue and needs to be decoded from the departure times. Such channels are of interest in computer security, since their existence provides a way to leak information across security boundaries in a covert way. Anantharam and Verdu (1994) determined that the S...
متن کاملA pairwise error probability bound for the exponential- server timing channel
We exhibit upper and lower bounds on the pairwise error probability of the exponential-server timing channel in terms of an appropriately-defined distance between codewords. We show that this distance plays a crucial role in determining the reliability function at low rates. In particular, by lower bounding the minimum distance of good low-rate codes, we provide an improved lower bound on the r...
متن کاملOn the reliability exponent of the exponential timing channel
We determine the reliability exponent ( ) of the Anantharam–Verdú exponential server timing channel with service rate for all rates between a critical rate = ( 4) log 2 and the channel capacity = 1 . For rates between 0 and , we provide a random-coding lower bound ( ) and a sphere-packing upper bound ( ) on ( ). We also determine that the cutoff rate 0 for this channel equals 4, thus answering ...
متن کاملOn the zero-rate error exponent for a BSC with noisy feedback
For information transmission, a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes (without delay) all outputs of the forward channel via the feedback channel. Transmission of nonexponentially many messages is considered (i.e., the transmission rate is zero). The achievable decoding error exponent for this comb...
متن کاملSequential decoding for the exponential server timing channel
We show the existence of a good tree code with a sequential decoder for the exponential server timing channel. The expected number of computations before moving one step ahead is upper-bounded by a finite number. The rate of information transfer for this code is (2 ) nats per second, i.e., one half of the capacity. The cutoff rate for the exponential server queue is therefore at least (2 ) nats...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002